Heavy-traffic analysis of a multi-class queue with relative priorities
نویسندگان
چکیده
We study the steady-state queue-length vector in a multi-class single-server queue with relative priorities. Upon service completion, the probability that the next customer to be served is from class k is controlled by class-dependent weights. Once a customer has started service, it is served without interruption until completion. This is a generalization of the random-order-of-service discipline. We investigate the system in a heavy-traffic regime. We first establish a state-space collapse for the scaled queue length vector, that is, in the limit the scaled queue length vector is distributed as the product of an exponentially distributed random variable and a deterministic vector. As a direct consequence, we obtain that the scaled number of customers in the system reduces as classes with smaller mean service requirement obtain relatively larger weights. We then show that the scaled waiting time of a class-k customer is distributed as the product of two exponentially distributed random variables. This allows us to determine the value of the weights that minimize the m-th moment of the scaled waiting time for a customer of arbitrary class. We simulate a system with two different classes of customers in order to numerically verify some of the analytical results.
منابع مشابه
Heavy-traffic analysis of a non-preemptive multi-class queue with relative priorities
We study the steady-state queue-length vector in a multi-class queue with relative priorities. Upon service completion, the probability that the next served customer is from class k is controlled by class-dependent weights. Once a customer has started service, it is served without interruption until completion. We establish a state-space collapse for the scaled queue length vector in the heavy-...
متن کاملInterpolation approximations for the steady-state distribution in multi-class resource-sharing systems
We consider a single-server multi-class queue that implements relative priorities among customers of the various classes. The discipline might serve one customer at a time in a non-preemptive way, or serve all customers simultaneously. The analysis of the steadystate distribution of the queue-length and thewaiting time in such systems is complex and closed-form results are available only in par...
متن کاملMulticlass Queueing Systems in Heavy Traffic: An Asymptotic Approach Based on Distributional and Conservation Laws
We propose a new approach to analyze multiclass queueing systems in heavy traffic based on what we consider as fundamental laws in queueing systems, namely distributional and conservation laws. Methodologically, we extend the distributional laws from single class queueing systems to multiple classes and combine them with conservation laws to find the heavy traffic behavior of the following syst...
متن کاملA Sustained QoS Solution by Contention Adaptation in IEEE 802.11e Wireless LANs
The most significant issue in 802.11 contention based networks is to prevent collisions and to ensure connection quality. Researchers have shown an increased interest in collision aware back-off algorithms. However, collision aware back-off algorithms are still failed to ensure strict priority for the high priority traffic. Especially in the heavy loading network, a large number of unsuccessful...
متن کاملA two-queue polling model with priority on one queue and heavy-tailed On/Off sources: a heavy-traffic limit
We consider a single-server polling system consisting of two queues of fluid with arrival process generated by a big number of heavy-tailed On/Off sources, and application in road traffic and communication systems. Classj fluid is assigned to queue j, j = 1,2. Server 2 visits both queues to process or let pass through it the corresponding fluid class. If there is class-2 fluid in the system, it...
متن کامل